Convex Relaxation of Vectorial Problems with Coupled Regularization
نویسندگان
چکیده
We propose convex relaxations for nonconvex energies on vector-valued functions which are tractable yet as tight as possible. In contrast to existing relaxations, we can handle the combination of nonconvex data terms with coupled regularizers such as l-regularizers. The key idea is to consider a collection of hypersurfaces with a relaxation that takes into account the entire functional rather than separately treating the data term and the regularizers. We provide a theoretical analysis, detail the implementations for different functionals, present run time and memory requirements, and experimentally demonstrate that the coupled l-regularizers give systematic improvements regarding denoising, inpainting, and optical flow estimation.
منابع مشابه
Uzawa Block Relaxation Methods for Color Image Restoration
In this paper we propose to investigate the use of a vectorial total variation model with spatially varying regularization and data terms for color image denoising and restoration. We pay attention to two main minimization problems: the minimization of a weighted vectorial total variation term TVg, which acts as a regularization term, using the L norm as data term or the minimization of the vec...
متن کاملSublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies
Convex relaxations of multilabel problems have been demonstrated to produce provably optimal or near-optimal solutions to a variety of computer vision problems. Yet, they are of limited practical use as they require a fine discretization of the label space, entailing a huge demand in memory and runtime. In this work, we propose the first sublabel accurate convex relaxation for vectorial multila...
متن کاملMulti-stage Convex Relaxation for Learning with Sparse Regularization
We study learning formulations with non-convex regularizaton that are natural for sparse linear models. There are two approaches to this problem: • Heuristic methods such as gradient descent that only find a local minimum. A drawback of this approach is the lack of theoretical guarantee showing that the local minimum gives a good solution. • Convex relaxation such as L1-regularization that solv...
متن کاملDon't relax: early stopping for convex regularization
We consider the problem of designing efficient regularization algorithms when regularization is encoded by a (strongly) convex functional. Unlike classical penalization methods based on a relaxation approach, we propose an iterative method where regularization is achieved via early stopping. Our results show that the proposed procedure achieves the same recovery accuracy as penalization methods...
متن کاملAnalysis of Multi-stage Convex Relaxation for Sparse Regularization
We consider learning formulations with non-convex objective functions that often occur in practical applications. There are two approaches to this problem: • Heuristic methods such as gradient descent that only find a local minimum. A drawback of this approach is the lack of theoretical guarantee showing that the local minimum gives a good solution. • Convex relaxation such as L1-regularization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Imaging Sciences
دوره 7 شماره
صفحات -
تاریخ انتشار 2014